Finding points on curves over nite eldsExtended

نویسنده

  • Igor Shparlinski
چکیده

We solve two computational problems concerning plane algebraic curves over nite elds: generating an (approximately) uniform random point, and nding all points deterministically in amortized polynomial time (over a prime eld, for non-exceptional curves).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Good Random Elliptic Curves for Cryptosystems Deened over If 2 N

One of the main diiculties for implementing cryptographic schemes based on elliptic curves deened over nite elds is the necessary computation of the cardinality of these curves. In the case of nite elds IF2n, recent theoretical breakthroughs yield a signiicant speed up of the computations. Once described some of these ideas in the rst part of this paper, we show that our current implementation ...

متن کامل

On the elliptic curves of the form $ y^2=x^3-3px $

By the Mordell-Weil theorem‎, ‎the group of rational points on an elliptic curve over a number field is a finitely generated abelian group‎. ‎There is no known algorithm for finding the rank of this group‎. ‎This paper computes the rank of the family $ E_p:y^2=x^3-3px $ of elliptic curves‎, ‎where p is a prime‎.

متن کامل

Generating Elliptic Curves over Finite Fields Part I: Generating by Complex Multiplication

We study the theory of rational points on elliptic curves over nite elds and the theory of complex multiplication through which we construct elliptic curves over F p such that their orders of the group of rational points over F p are of the form mr where r is a prime and m is a small integer.

متن کامل

Counting the Number of Points on Elliptic Curves over Nite Elds of Characteristic Greater than Three

We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the the number points on a curve over F p , where p is a 210-digit prime.

متن کامل

A Class of Polynomials over Finite Fields

Generalizing the norm and trace mappings for % O P /% O , we introduce an interesting class of polynomials over "nite "elds and study their properties. These polynomials are then used to construct curves over "nite "elds with many rational points. 1999 Academic Press

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007